21![An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡](https://www.pdfsearch.io/img/efad94eb424cb5931eb2d7b831951403.jpg) | Add to Reading ListSource URL: kam.mff.cuni.czLanguage: English - Date: 2009-06-04 05:35:50
|
---|
22![tria-free-after-review14.dvi tria-free-after-review14.dvi](https://www.pdfsearch.io/img/3f6b25d81df6bc51a20971d893712436.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2012-04-30 01:42:59
|
---|
23![Connected Dominating Set in Graphs Without Long Paths And Cycles Eglantine Camby1 and Oliver Schaudt2 1 D´epartement de Math´ematique, Universit´e Libre de Bruxelles, Boulevard du Triomphe, 1050 Connected Dominating Set in Graphs Without Long Paths And Cycles Eglantine Camby1 and Oliver Schaudt2 1 D´epartement de Math´ematique, Universit´e Libre de Bruxelles, Boulevard du Triomphe, 1050](https://www.pdfsearch.io/img/2263e1b689632ac16da58499bfd7bfd1.jpg) | Add to Reading ListSource URL: homepages.ulb.ac.beLanguage: English - Date: 2015-10-11 06:53:34
|
---|
24![Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2 Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2](https://www.pdfsearch.io/img/4653d6c09c80b0946258e339d5d27aa2.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2016-01-03 06:46:50
|
---|
25![Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †](https://www.pdfsearch.io/img/17b3b43af0c9735e1a13564ce8574f55.jpg) | Add to Reading ListSource URL: www.tik.ee.ethz.chLanguage: English - Date: 2015-05-18 12:16:16
|
---|
26![Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova](https://www.pdfsearch.io/img/75aac214f768cbfcd8d8fd0d2f261750.jpg) | Add to Reading ListSource URL: nms.citi.sinica.edu.twLanguage: English - Date: 2013-02-26 21:19:15
|
---|
27![B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem](https://www.pdfsearch.io/img/9034801e296d443fb50d4de1c1e50513.jpg) | Add to Reading ListSource URL: www.caam.rice.eduLanguage: English - Date: 2006-08-14 16:34:49
|
---|
28![JMLR: Workshop and Conference Proceedings vol 40:1–13, 2015 Online Learning with Feedback Graphs: Beyond Bandits Noga Alon NOGAA @ POST. TAU . AC . IL JMLR: Workshop and Conference Proceedings vol 40:1–13, 2015 Online Learning with Feedback Graphs: Beyond Bandits Noga Alon NOGAA @ POST. TAU . AC . IL](https://www.pdfsearch.io/img/2ee567aaca3f6e3f9d4b8f66afd8f7a4.jpg) | Add to Reading ListSource URL: jmlr.orgLanguage: English - Date: 2015-07-20 20:08:35
|
---|
29![Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2 Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2](https://www.pdfsearch.io/img/d772c5dc68597346bf1b97defa9357e1.jpg) | Add to Reading ListSource URL: fpt.akt.tu-berlin.deLanguage: English - Date: 2015-08-10 10:23:26
|
---|
30![Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120](https://www.pdfsearch.io/img/8ec2145cd55bf76b0d38e3c344cd30ca.jpg) | Add to Reading ListSource URL: www.levreyzin.comLanguage: English - Date: 2013-03-20 23:48:10
|
---|